Finding Temporal Patterns Using Constraints on %28Partial%29 Absence

Association Rules.
We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed algorithms can be combined into a hybrid algorithm, called AprioriHybrid. Scale-up experiments show that AprioriHybrid scales linearly with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database. 1 Introduction Progress in bar-code technology has made it possible for retail organizations to collect and store massive amounts of sales data, referred to as the basket data. A record in such data typically consists of the tran...
Learning in parallel universes.

Compensation of Translational Displacement in Time Series Clustering Using Cross Correlation.

How Much True Structure Has Been Discovered%3F

Clustering with Size Constraints.

On exploiting the power of time in data mining.

Landscape Multidimensional Scaling.

Classification Based on the Trace of Variables over Time.

Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains.

Reliably Capture Local Clusters in Noisy Domains From Parallel Universes.

Equi%2Dsized%2C Homogeneous Partitioning.

Objective Function%2Dbased Discretization.

Association Rules.
We consider the problem of discovering association rules between items in a large database of sales transactions. We present two new algorithms for solving this problem that are fundamentally different from the known algorithms. Empirical evaluation shows that these algorithms outperform the known algorithms by factors ranging from three for small problems to more than an order of magnitude for large problems. We also show how the best features of the two proposed algorithms can be combined into a hybrid algorithm, called AprioriHybrid. Scale-up experiments show that AprioriHybrid scales linearly with the number of transactions. AprioriHybrid also has excellent scale-up properties with respect to the transaction size and the number of items in the database. 1 Introduction Progress in bar-code technology has made it possible for retail organizations to collect and store massive amounts of sales data, referred to as the basket data. A record in such data typically consists of the tran...
Local Pattern Detection and Clustering.

Fuzzy information granules in time series data.

An alternative approach to the fuzzifier in fuzzy clustering to obtain better clustering.
The most common fuzzy clustering algorithms are based on the minimization of an objective function that evaluates (fuzzy) cluster partitions. The generalisation step from hard clustering to crisp clustering requires the introduction of an additional parameter, the so called fuzzifier. This fuzzifier does not only control, how much clusters may overlap, but has also some undesired consequences. For example, data have (almost) always non-zero membership degrees to all clusters, no matter how far they are away from a cluster.


Improved fuzzy partitions for fuzzy regression models.

Handling Feature Ambiguity in Knowledge Discovery from Time Series.

Time Series Abstraction Methods %2D A Survey.

Discovery of Core Episodes from Sequences.

Speeding up fuzzy c%2Dmeans using a hierarchical data organisation to control the precision of membership calculation.

Finding informative rules in interval sequences.
Observing a binary feature over a period of time yields a sequence of observation intervals. To ease the access to continuous features (like time series), they are often broken down into attributed intervals, such that the attribute describes the series&#039; behaviour within the segment (e.g. increasing, high-value, highly convex, etc.). In both cases, we obtain a sequence of interval data, in which temporal patterns and rules can be identified. A temporal pattern is defined as a set of labeled intervals together with their interval relationships described in terms of Allen&#039;s interval logic. In this paper, we consider the evaluation of such rules in order to find the most informative rules. We discuss rule semantics and outline de ciencies of the previously used rule evaluation. We apply the J-measure to rules with a modified semantics in order to better cope with different lengths of the temporal patterns. We also consider the problem of specializing temporal rules by additional attributes of the state intervals.
Learning indistinguishability from data.

Finding Informative Rules in Interval Sequences.
Observing a binary feature over a period of time yields a sequence of observation intervals. To ease the access to continuous features (like time series), they are often broken down into attributed intervals, such that the attribute describes the series&#039; behaviour within the segment (e.g. increasing, high-value, highly convex, etc.). In both cases, we obtain a sequence of interval data, in which temporal patterns and rules can be identified. A temporal pattern is defined as a set of labeled intervals together with their interval relationships described in terms of Allen&#039;s interval logic. In this paper, we consider the evaluation of such rules in order to find the most informative rules. We discuss rule semantics and outline de ciencies of the previously used rule evaluation. We apply the J-measure to rules with a modified semantics in order to better cope with different lengths of the temporal patterns. We also consider the problem of specializing temporal rules by additional attributes of the state intervals.
Discovery of Temporal Patterns. Learning Rules about the Qualitative Behaviour of Time Series.
. Recently, association rule mining has been generalized to the  discovery of episodes in event sequences. In this paper, we additionally  take durations into account and thus present a generalization to time  intervals. We discover frequent temporal patterns in a single series of  such labeled intervals, which we call a state sequence. A temporal pattern  is dened as a set of states together with their interval relationships  described in terms of Allen&#039;s interval logic, for instance \A before B,  A overlaps C, C overlaps B&#034; or equivalently \state A ends before state  B starts, the gap is covered by state C&#034;. As an example we consider  the problem of deriving local weather forecasting rules that allow us to  conclude from the qualitative behaviour of the air-pressure curve to the  wind-strength. Here, the states have been extracted automatically from  (multivariate) time series and characterize the trend of the time series  locally within the assigned time interval.  1 
Obtaining interpretable fuzzy models from fuzzy clustering and fuzzy regression.
In this paper we develop an objective functionbased clustering algorithm to build fuzzy models of the Takagi-Sugeno (TS) type automatically from data. In contrast to most of the TS models that can be found in the literature, we decided to use very simple input-space partitions and a higher degree of consequence polynomials (quadratic). Only in this way transparency and interpretability can be guaranteed. We also show how to derive linguistic labels for the polynomials found by the algorithm.
